Multiple-Choice Assignments on Uniformly Related Machines
نویسنده
چکیده
منابع مشابه
A PTAS for Minimizing Average Weighted Completion Time With Release Dates on Uniformly Related Machines
A classical scheduling problem is to find schedules that minimize average weighted completion time of jobs with release dates. When multiple machines are available, the machine environments may range from identical machines (the processing time required by a job is invariant across the machines) at one end, to unrelated machines (the processing time required by a job on any machine is an arbitr...
متن کاملA PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machines (the processing time required by a job is invariant across the machines) at one end of the spectrum to unrelated machines (the processing time required by a job on each machine...
متن کاملA PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (Extended Abstract)
We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machines (the processing time required by a job is invariant across the machines) at one end of the spectrum to unrelated machines (the processing time required by a job on each machine...
متن کاملA lower bound for on-line scheduling on uniformly related machines
We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.
متن کاملAn efficient polynomial time approximation scheme for load balancing on uniformly related machines
We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, Ci denotes the completion time of machine i. Our goal is to find a schedule which minimizes or maximizes m
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002